$N$ -Dimensional Approximation of Euclidean Distance

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel N-Dimensional Exact Signed Euclidean Distance Transform

The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce an N-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n voxels...

متن کامل

Approximation of the Euclidean Distance by Chamfer Distances

Chamfer distances play an important role in the theory of distance transforms. Though the determination of the exact Euclidean distance transform is also a well investigated area, the classical chamfering method based upon ”small” neighborhoods still outperforms it e.g. in terms of computation time. In this paper we determine the best possible maximum relative error of chamfer distances under v...

متن کامل

On Least Squares Euclidean Distance Matrix Approximation and Completion

The Euclidean distance matrix approximation problem as well as the completion problem have received a lot of attention in recent years because of their many important applications. In contrast to the many interesting but often sophisticated algorithms proposed in the literature, this paper offers a relatively straightforward procedure that can tackle both problems by the same framework. The loc...

متن کامل

New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications

Al~traet--In this paper, we propose a new method to obtain the Euclidean distance transformation and the Voronoi diagram based on the exact Euclidean metric for an n-dimensional picture. We present four algorithms to perform the transformation which are constructed by the serial composition of n-dimensional filters. When performed by a general purpose computer, they are faster than the method b...

متن کامل

Lines in n-Dimensional Euclidean Spaces

In this paper, we define the line of n-dimensional Euclidean space and we introduce basic properties of affine space on this space. Next, we define the inner product of elements of this space. At the end, we introduce orthogonality of lines of this space. provide the terminology and notation for this paper. (4) (a · b) · x = a · (b · x). (6) a · (x 1 + x 2) = a · x 1 + a · x 2. (7) (a + b) · x ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems II: Express Briefs

سال: 2020

ISSN: 1549-7747,1558-3791

DOI: 10.1109/tcsii.2019.2919545